Design And Implementation of Shortest Path For Wavelength Routed Networks

نویسندگان

  • Balraj Singh
  • Ankita Mittal
چکیده

According to a quick growth of the bandwidth capacity of WDM network, traffic damage due to a failure of network components is becoming unacceptable. To overawe this problem, a protection method that prepares backup light paths for each working path is now considered to improve reliability of networks. In this paper, it proposes an energy efficient routing in WDM passive optical networks. Routing means to provide a connection between source and destination node. Optimal Routing can increase efficiency of wavelength routed optical networks. Provisioning a connection in such a network includes defining a time-slot assignment, in addition to route and wavelength. Then their effect on performance parameters like energy has been calculated. The results show that it reduces the energy consumption. The simulations have been done with MATLAB tool and Its GUI. KeywordsShortest Routing, path in Networks, WDM Networks, Efficient Routing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

Adaptive Weight Functions for Shortest Path Routing Algorithms for Multi-Wavelength Optical WDM Networks

Optical Dense Wavelength Division Multiplexed (DWDM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider the wide area wavelength routed backbone network with circuit-switching. Given a session request, the routing and wavelength assignment (RWA) problem is to calculate a path between two nodes, and also assign a set of wavelengths along ...

متن کامل

A novel load - balanced fixed routing ( LBFR ) algorithm for wavelength routed optical networks

In the wavelength-routed optical transport networks, fixed shortest path routing is one of major lightpath service provisioning strategies, which shows simplicity in network control and operation. Specifically, once a shortest route is found for a node pair, the route is always used for any future lightpath service provisioning, which therefore does not require network control and management sy...

متن کامل

Multiperiod virtual topology design in wavelength routed optical networks - Circuits, Devices and Systems, IEE Proceedings [see also IEE Proceedings G- Circuits, Devices and

A wavelength routed optical network is considered for which the traffic matrix and possibly the physical topology are different during different periods of a time horizon. The optimal virtual topology for each of the periods will be different. Rather than using the best topology in every period and incurring a possibly significant reconfiguration cost, it is necessary to consider the optimum se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014